An Optimal Execution of Composite Service in Decentralized Environment

It is important for service-oriented architectures to consider about how the composition of web services affects business processes. For instance, a single service may not have been adequate most complex operations, needing use multiple services. This paper proposed novel technique optimal partitioning and execution using decentralized environment. The designed developed genetic algorithm with high task allocations on server. We compared three existing techniques, including meta-heuristic algorithm, heuristics like Pooling-and-Greedy-Merge (PGM) technique, Merge-by-Define-Use (MDU) simulation Business Process Execution Language (BPEL) partition through tasks allocation server node. practical advantageous. In terms time, number requests, throughput, outperformed GA, PGM, MDU techniques.